A Feasibility Study in Iterative Compilation

In this paper we investigate the feasibility of iterative compilation in program optimisation. This technique enables compilers to deliver eecient code by searching for the best sequence of optimisations. In embedded systems, long compilation time can be aaorded since the application is an integral part of the shipped product. However, in practice search spaces may be extremely large. Our experimental results show that in the case of large transformation spaces, near optimal transformations can be found by visiting only a small fraction of the entire search space by using a simple search algorithm.